import math

n = int(input())

if n < 2:
    print(0)
else:
    dp = [0] * (n + 1)
    dp[2] = 1  # 初始条件，n=2时只有一种分解方式

    for i in range(3, n + 1):
        factors = set()
        # 枚举所有可能的因子
        for j in range(2, int(math.sqrt(i)) + 1):
            if i % j == 0:
                if j < i and j >= 2:
                    factors.add(j)
                counterpart = i // j
                if counterpart < i and counterpart >= 2 and counterpart != j:
                    factors.add(counterpart)
        # 计算所有因子对应的分解数目之和
        sum_val = 0
        for d in factors:
            sum_val += dp[i // d]
        dp[i] = 1 + sum_val  # 加上自身的情况

    print(dp[n])
